package util;

import java.util.HashMap;
import java.util.HashSet;

public class TreeNode {
        public Integer val;
        public TreeNode left;
        public TreeNode right;
        public TreeNode(Integer x) { val = x; }


        public static TreeNode getTreeNode(Integer[] nums){
            HashSet<Integer> set = new HashSet<>();
            TreeNode root = new TreeNode(nums[0]);
            set.add(0);
            int index = 1;
            TreeNode node = root;
            while (index < nums.length){
                TreeNode left = new TreeNode(nums[index]);
                node.left = left;
                index++;
                TreeNode right = new TreeNode(nums[index]);
                node.right = right;
                index++;
                node = node.left;
            }
            return root;
        }


    public static void main(String[] args) {
        int a = 2;
        a = a<<1;
        System.out.println(a);
    }

}